منابع مشابه
Matching typed and untyped realizability ( Extended abstract )
Realizability interpretations of logics are given by saying what it means for computational objects of some kind to realize logical formulae. The computational objects in question might be drawn from an untyped universe of computation, such as a partial combinatory algebra, or they might be typed objects such as terms of a PCF-style programming language. In some instances, one can show that a p...
متن کاملTyped vs. Untyped Realizability
We study the domain-theoretic semantics of a Church-style typed λ-calculus with constructors, pattern matching and recursion, and show that it is closely related to the semantics of its untyped counterpart. The motivation for this study comes from program extraction from proofs via realizability where one has the choice of extracting typed or untyped terms from proofs. Our result shows that und...
متن کاملTyped Processes in Untyped Contexts
S is a print spooler serving requests from a private channel s that it communicates to its clients via the public channel d. C is one such client, that receives s and uses it to print the job j. While the intention of the specification is clear, reasoning on its properties is subtler. For instance, given the initial configuration S |C, can we prove that the jobs sent by C are eventually receive...
متن کاملTyped realizability for first-order classical analysis
We describe a realizability framework for classical first-order logic in which realizers live in (a model of) typed λμ-calculus. This allows a direct interpretation of classical proofs, avoiding the usual negative translation to intuitionistic logic. We prove that the usual terms of Gödel’s system T realize the axioms of Peano arithmetic, and that under some assumptions on the computational mod...
متن کاملRelative Expressiveness of Typed and Untyped Relational Algebra
We consider relational databases with typed attributes and are interested in relational algebra expressions which always result in a relation of some xed type. Such expressions are called \type-safe". Type-safety is undecidable. We also consider \typed" relational algebra expressions, which are syntactically guaranteed to be type-safe. We then show that every expression is equivalent to a union...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 1999
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)00105-7